Trade-offs between Shared Virtual Memory and Message-passing on an Ipsc/2 Hypercube Thierry Priol and Zakaria Lahjomri

نویسندگان

  • Thierry PRIOL
  • Zakaria LAHJOMRI
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

KOAN: A Shared Virtual Memory for the iPSC/2 Hypercube

In this paper, we describe the salient features of an implementation of a shared virtual memory (SVM), named KOAN, running on an iPSC/2 hypercube. A SVM provides to the user an abstraction from an underlying memory architecture. A SVM is a virtual address space that is shared by a number of processes running on diierent processors of a distributed memory parallel computer. This concept allows t...

متن کامل

Experiments with Shared Virtual Memory on a iPSC/2 Hypercube

This paper presents the results of an experiment which evaluates the performance of shared virtual memory (SVM) running on a distributed memory parallel architecture (iPSC/2 hypercube). A parallel version of the modiied Gram-Schmidt algorithm, designed to run with a SVM, is presented. Experimental results are provided.

متن کامل

A Comparison of Shared Virtual Memory and Message Passing Programming Techniques Based on a Finite Element Application

This paper describes the methods used and experiences made with implementing a nite element application on three diierent parallel computers with either message passing or shared virtual memory as the programming model. Designing a parallel nite element application using message-passing requires to nd a data domain decomposition to map data into the local memory of the processors. Since data ac...

متن کامل

Trade-oos between Shared Virtual Memory and Message-passing on an Ipsc/2 Hypercube M Emoire Virtuelle Partag Ee Ou Echange De Messages Sur Un Hypercube Ipsc/2 ?

This paper presents the results of an experiment which evaluates the performance of shared virtual memory running on a distributed memory parallel architecture (iPSC/2 hypercube). Two parallel versions of the modiied Gram-Schmidt algorithm are presented. Each uses two disparate distribution schemes: data distribution; and control distribution. In the rst case, cooperation between processes is a...

متن کامل

Shared Virtual Memory and Message Passing Programming on a Finite Element Application

This paper describes the methods used and experiences made with implementing a nite element application on three diierent parallel computers with either message passing or shared virtual memory as the programming model. Designing a parallel nite element application using message-passing requires to nd a data domain decomposition to map data into the local memory of the processors. Since data ac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992